Bicycles and left–right tours in locally finite graphs
نویسندگان
چکیده
منابع مشابه
Bicycles and left-right tours in locally finite graphs
We extend three results involving bicycles and left-right tours to infinite, locally finite graphs: Read and Rosenstiehl’s tripartition theorem, Shank’s theorem that the residues of left-right tours generate the bicycle space and the planarity criterion of Archdeacon, Bonnington and Little. In order to achieve this it is necessary to allow infinite cycles as defined by Diestel and Kühn.
متن کاملTopological Circles and Euler Tours in Locally Finite Graphs
We obtain three results concerning the topological cycle space C of a locally finite connected graph G. Confirming a conjecture of Diestel we show that through every edge set E ∈ C there is a topological Euler tour, a continuous map from the circle S to the end compactification |G| of G that traverses every edge in E exactly once and traverses no other edge. Second, we show that for every seque...
متن کاملFinite locally-quasiprimitive graphs
A 1nite graph is said to be locally-quasiprimitive relative to a subgroup G of automorphisms if, for all vertices , the stabiliser in G of is quasiprimitive on the set of vertices adjacent to . (A permutation group is said to be quasiprimitive if all of its non-trivial normal subgroups are transitive.) The graph theoretic condition of local quasiprimitivity is strictly weaker than the condition...
متن کاملGeodesic topological cycles in locally finite graphs
We prove that the topological cycle space C(G) of a locally finite graph G is generated by its geodesic topological circles. We further show that, although the finite cycles of G generate C(G), its finite geodesic cycles need not generate C(G).
متن کاملEulerian edge sets in locally finite graphs
In a finite graph, an edge set Z is an element of the cycle space if and only if every vertex has even degree in Z. We extend this basic result to the topological cycle space, which allows infinite circuits, of locally finite graphs. In order to do so, it becomes necessary to attribute a parity to the ends of the graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2009
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2008.06.002